Removal of noise from seismic data using improved tau-P filters

ABSTRACT

Methods of processing seismic data to remove unwanted noise from meaningful reflection signals are provided for. The seismic data is transformed from the offset-time domain to the time-slowness domain using a Radon transformation. A high-low, preferably a time variant, high low corrective filter is then applied to enhance the primary reflection signal content of the data and to eliminate unwanted noise events. The tau-P filter is defined by reference to the velocity function of the primary reflection signals, and preferably is expressed as: 
     
       
         
           
             
               1 
               
                 
                   v 
                   s 
                 
                  
                 
                   ( 
                   
                     1 
                     + 
                     
                       r 
                       2 
                     
                   
                   ) 
                 
               
             
             ≤ 
             p 
             ≤ 
             
               1 
               
                 
                   v 
                   s 
                 
                  
                 
                   ( 
                   
                     1 
                     - 
                     
                       r 
                       1 
                     
                   
                   ) 
                 
               
             
           
         
         
         
             
         
       
     
     where r 1  and r 2  are percentages expressed as decimals. The slowness limits typically are set within±15% of the velocity function, and r 1  and r 2  may be set accordingly. 
     After filtering, the enhanced signal content is inverse transformed from the time-slowness domain back to the offset-time domain using an inverse Radon transformation. Suitable forward and reverse Radon transformations incorporating an offset weighting factor x n  and its inverse p n , where 0&lt;n&lt;1, include the following continuous transform equations, and discrete versions thereof that approximate the continuous transform equations: 
     
       
         
           
             
               u 
                
               
                 ( 
                 
                   p 
                   , 
                   τ 
                 
                 ) 
               
             
             = 
             
               
                 ∫ 
                 
                   - 
                   ∞ 
                 
                 ∞ 
               
                
               
                 
                    
                   x 
                 
                  
                 
                   
                     ∫ 
                     
                       - 
                       ∞ 
                     
                     ∞ 
                   
                    
                   
                       
                   
                    
                   
                     
                        
                       t 
                     
                      
                     
                        
                       
                         ( 
                         
                           x 
                           , 
                           t 
                         
                         ) 
                       
                     
                      
                     
                       x 
                       n 
                     
                      
                     
                       δ 
                        
                       
                         [ 
                         
                           f 
                            
                           
                             ( 
                             
                               t 
                               , 
                               x 
                               , 
                               τ 
                               , 
                               p 
                             
                             ) 
                           
                         
                         ] 
                       
                     
                      
                     
                         
                     
                      
                     
                       ( 
                       
                         forward 
                          
                         
                             
                         
                          
                         transform 
                       
                       ) 
                     
                   
                 
               
             
           
         
         
           
             
               d 
                
               
                 ( 
                 
                   x 
                   , 
                   t 
                 
                 ) 
               
             
             = 
             
               
                 ∫ 
                 
                   - 
                   ∞ 
                 
                 ∞ 
               
                
               
                 
                    
                   p 
                 
                  
                 
                   
                     ∫ 
                     
                       - 
                       ∞ 
                     
                     ∞ 
                   
                    
                   
                       
                   
                    
                   
                     
                        
                       τ 
                     
                      
                     
                         
                     
                      
                     
                       p 
                       n 
                     
                      
                     
                       ρ 
                        
                       
                         ( 
                         τ 
                         ) 
                       
                     
                     * 
                     
                       u 
                        
                       
                         ( 
                         
                           p 
                           , 
                           τ 
                         
                         ) 
                       
                     
                      
                     
                       δ 
                        
                       
                         [ 
                         
                           g 
                            
                           
                             ( 
                             
                               t 
                               , 
                               x 
                               , 
                               τ 
                               , 
                               p 
                             
                             ) 
                           
                         
                         ] 
                       
                     
                      
                     
                         
                     
                      
                     
                       
                         ( 
                         
                           inverse 
                            
                           
                               
                           
                            
                           transform 
                         
                         ) 
                       
                       .

CLAIM TO PRIORITY

This application is a continuation-in-part of an application of John M. Robinson, Rule 47(b) Applicant, entitled “Removal of Noise From Seismic Data Using Improved Radon Transformations”, U.S. Ser. No. 10/232,118, filed Aug. 30, 2002.

BACKGROUND OF THE INVENTION

The present invention relates to processing of seismic data representative of subsurface features in the earth and, more particularly, to improved methods of processing seismic data using improved tau-P filters to remove unwanted noise from meaningful reflection signals.

Seismic surveys are one of the most important techniques for discovering the presence of oil and gas deposits. If the data is properly processed and interpreted, a seismic survey can give geologists a picture of subsurface geological features, so that they may better identify those features capable of holding oil and gas. Drilling is extremely expensive, and ever more so as easily tapped reservoirs are exhausted and new reservoirs are harder to reach. Having an accurate picture of an area's subsurface features can increase the odds of hitting an economically recoverable reserve and decrease the odds of wasting money, and effort on a nonproductive well.

The principle behind seismology is deceptively simple. As seismic waves travel through the earth, portions of that energy are reflected back to the surface as the energy waves traverse different geological layers. Those seismic echoes or reflections give valuable information about the depth and arrangement of the formations, some of which hopefully contain oil or gas deposits.

A seismic survey is conducted by deploying an array of energy sources and an array of sensors or receivers in an area of interest. Typically, dynamite charges are used as sources for land surveys, and air guns are used for marine surveys. The sources are discharged in a predetermined sequence, sending seismic energy waves into the earth. The reflections from those energy waves or “signals” then are detected by the array of sensors. Each sensor records the amplitude of incoming signals over time at that particular location. Since the physical location of the sources and receivers is known, the time it takes for a reflection signal to travel from a source to a sensor is directly related to the depth of the formation that caused the reflection. Thus, the amplitude data from the array of sensors can be analyzed to determine the size and location of potential deposits.

This analysis typically starts by organizing the data from the array of sensors into common geometry gathers. That is, data from a number of sensors that share a common geometry are analyzed together. A gather will provide information about a particular spot or profile in the area being surveyed. Ultimately, the data will be organized into many different gathers and processed before the analysis is completed and the entire survey area mapped.

The types of gathers typically used include: common midpoint, where the sensors and their respective sources share a common midpoint; common source, where all the sensors share a common source; common offset, where all the sensors and their respective sources have the same separation or “offset”; and common receiver where a number of sources share a common receiver. Common midpoint gathers are the most common gather today because they allow the measurement of a single point on a reflective subsurface feature from multiple source-receiver pairs, thus increasing the accuracy of the depth calculated for that feature.

The data in a gather is typically recorded or first assembled in the offset-time domain. That is, the amplitude data recorded at each of the receivers in the gather is assembled or displayed together as a function of offset, i.e., the distance of the receiver from a reference point, and as a function of time. The time required for a given signal to reach and be detected by successive receivers is a function of its velocity and the distance traveled. Those functions are referred to as kinematic travel time trajectories. Thus, at least in theory, when the gathered data is displayed in the offset-time domain, or “X-T” domain, the amplitude peaks corresponding to reflection signals detected at the gathered sensors should align into patterns that mirror the kinematic travel time trajectories. It is from those trajectories that one ultimately may determine an estimate of the depths at which formations exist.

A number of factors, however, make the practice of seismology and, especially, the interpretation of seismic data much more complicated than its basic principles. First, the reflected signals that indicate the presence of geological strata typically are mixed with a variety of noise.

The most meaningful signals are the so-called primary reflection signals, those signals that travel down to the reflective surface and then back up to a receiver. When a source is discharged, however, a portion of the signal travels directly to receivers without reflecting off of any subsurface features. In addition, a signal may bounce off of a subsurface feature, bounce off the surface, and then bounce off the same or another subsurface feature, one or more times, creating so-called multiple reflection signals. Other portions of the signal turn into noise as part of ground roll, refractions, and unresolvable scattered events. Some noise, both random and coherent, is generated by natural and man-made events outside the control of the survey.

All of this noise is occurring simultaneously with the reflection signals that indicate subsurface features. Thus, the noise and reflection signals tend to overlap when the survey data is displayed in X-T space. The overlap can mask primary reflection signals and make it difficult or impossible to identify patterns in the display upon which inferences about subsurface geology may be drawn. Accordingly, various mathematical methods have been developed to process seismic data in such a way that noise is separated from primary reflection signals.

Many such methods seek to achieve a separation of signal and noise by transforming the data from the X-T domain to other domains. In other domains, such as the frequency-wavenumber (F-K) domain or the time-slowness (tau-P), there is less overlap between the signal and noise data. Once the data is transformed, various mathematical filter; are applied to the transformed data to eliminate as much of the noise as possible and, thereby to enhance the primary reflection signals. The data then is inverse transformed back into the offset-time domain for interpretation or further processing.

For example, so-called Radon filters are commonly used to attenuate or remove multiple reflection signals. Such methods rely on Radon transformation equations to transform data from the offset-time (X-T) domain to the time-slowness (tau-P) where it can be filtered. More specifically, the X-T data is transformed along kinematic travel time trajectories having constant velocities and slownesses, where slowness p is defined as reciprocal velocity (or p=1/v).

Such prior art Radon methods, however, typically first process the data to compensate for the increase in travel time as sensors are further removed from the source. This step is referred to as normal moveout or “NMO” correction. It is designed to eliminate the differences in time that exist between the primary reflection signals recorded at close-in receivers, i.e., at near offsets, and those recorded at remote receivers, i.e., at far offsets. Primary signals, after NMO correction, generally will transform into the tau-P domain at or near zero slowness. Thus, a mute filter may be defined and applied in the tau-P domain. The filter mutes, i.e., excludes all data, including the transformed primary signals, below a defined slowness value p_(mute).

The data that remains after applying the mute filter contains a substantial portion of the signals corresponding to multiple reflections. That unmuted data is then transformed back into offset-time space and is subtracted from the original data in the gather. The subtraction process removes the multiple reflection signals from the data gather, leaving the primary reflection signals more readily apparent and easier to interpret.

It will be appreciated, however, that in such prior art Radon filters, noise and multiple reflection signals recorded by receivers close to the gather reference point (“near trace multiples”) are not as effectively separated from the primary reflections. The lack of separation in large part is an artifact of the NMO correction performed prior to transformation. Because NMO correction tends to eliminate offset time differences in primary signals, primary signals and near trace multiple signals both transform at or near zero slowness in the tau-P domain. When the mute filter is applied, therefore, the near trace multiples are muted along with the primary signal. Since they are muted, near trace multiples are not subtracted from and remain in the original data gather as noise that can mask primary reflection signals.

Radon filters have been developed for use in connection with common source, common receiver, common offset, and common midpoint gathers. They include those based on linear slant-stack, parabolic, and hyperbolic kinematic travel time trajectories. The general case forward transformation equation used in Radon filtration processes, R(p,τ)[d(x,t)], is set forth below: u(p, τ) = ∫_(−∞)^(∞)  x∫_(−∞)^(∞)  t(x, t)δ[f(t, x, τ, p)]  (forward  transformation)

where

u(p,τ)=transform coefficient at slowness p and zero-offset time

τd(x,t)=measured seismogram at offset x and two-way time t

p=slowness

t=two-way travel time

τ=two-way intercept time at p=0

x=offset

δ=Dirac delta function

ƒ(t,x,τ,p)=forward transform function

The forward transform function for linear slant stack kinematic travel time trajectories is as follows:

ƒ(t,x,τ,p)=t−τ−px

where $\begin{matrix} {{\delta \left\lbrack {f\left( {t,x,\tau,p} \right)} \right\rbrack} = {\delta \left( {t - \tau - {px}} \right)}} \\ {{= 1},{{{when}\quad t} = {\tau + {px}}},{and}} \\ {{= 0},{{elsewhere}.}} \end{matrix}$

Thus, the forward linear slant stack Radon transformation equation becomes u(p, τ) = ∫_(−∞)^(∞)  x(x, τ + px)

The forward transform function for parabolic kinematic trajectories is as follows:

ƒ(t,x,τ,p)=t−τ−px ²

where $\begin{matrix} {{\delta \left\lbrack {f\left( {t,x,\tau,p} \right)} \right\rbrack} = {\delta \left( {t - \tau - {px}^{2}} \right)}} \\ {{= 1},{{{when}\quad t} = {\tau + {px}^{2}}},{and}} \\ {{= 0},{{elsewhere}.}} \end{matrix}$

Thus, the forward parabolic Radon transformation equation becomes u(p, τ) = ∫_(−∞)^(∞)  x(x, τ + px²)

The forward transform function for hyperbolic kinematic travel time trajectories is as follows:

ƒ(t, x,τ,p)=t−{square root over (τ²+p²x²)}

where $\begin{matrix} {{\delta \left\lbrack {f\left( {t,x,\tau,p} \right)} \right\rbrack} = {\delta \left( {t - \sqrt{\tau^{2} + {p^{2}x^{2}}}} \right)}} \\ {{= 1},{{{when}\quad t} = \sqrt{\tau^{2} + {p^{2}x^{2}}}},{and}} \\ {{= 0},{{elsewhere}.}} \end{matrix}$

Thus, the forward hyperbolic Radon transformation equation becomes ${u\left( {p,\tau} \right)} = {\int_{- \infty}^{\infty}\quad {{x}{\left( {x,\sqrt{\tau^{2} + {p^{2}x^{2}}}} \right)}}}$

A general case inverse Radon transformation equation is set forth below:

d(x, t) = ∫_(−∞)^(∞)  p∫_(−∞)^(∞)τ  ρ(τ) * u(p, τ)δ[g(t, x, τ, p)]  (inverse  transformation)

where

g(t,x,τ,p)=inverse transform function, and

ρ(τ)*=convolution of rho filter.

The inverse transform function for linear slant stack kinematic trajectories is as follows:

g(t,x,τ,p)=τ−t+px

Thus, when τ=t−px, the inverse linear slant stack Radon transformation equation becomes d(x, t) = ∫_(−∞)^(∞)  p  ρ(τ) * u(p, t − px)

The inverse transform function for parabolic trajectories is as follows:

g(t,x,τ,p)=τ−t+px ²

Thus, when τ=t−px², the inverse linear slant stack Radon transformation equation becomes d(x, t) = ∫_(−∞)^(∞)  p  ρ(τ) * u(p, t − px²)

The inverse transform function for hyperbolic trajectories is as follows:

g(t,x τ,p)=τ−{square root over (t ² −p ² x ²)}

Thus, when τ={square root over (t²−p²x²)}, the inverse hyperbolic Radon transformation equation becomes ${d\left( {x,t} \right)} = {\int_{- \infty}^{\infty}\quad {{p}\quad {\rho (\tau)}*{u\left( {p,\sqrt{t^{2} - {p^{2}x^{2}}}} \right)}}}$

The choice of which form of Radon transformation preferably is guided by the travel time trajectory at which signals of interest in the data are recorded. Common midpoint gathers, because they offer greater accuracy by measuring a single point from multiple source-receiver pairs., are preferred over other types of gathers. Primary reflection signals in a common midpoint gather generally will have hyperbolic kinematic trajectories. Thus, it would be preferable to use hyperbolic Radon transforms.

To date, however, Radon transformations based on linear slant stack and parabolic trajectories have been more commonly used. The transform function for hyperbolic trajectories contains a square root whereas those for linear slant stack and parabolic transform functions do not. Thus, the computational intensity of hyperbolic Radon transformations has in large part discouraged their use in seismic processing.

It has not been practical to accommodate the added complexity of hyperbolic Radon transformations because the computational requirements of conventional processes are already substantial. NMO correction involves a least-mean-squares (“LMS”) energy minimization calculation. Forward and inverse Radon transforms also are not exact inverses of each other. Accordingly, an additional LMS calculation is often used in the transformation. Those calculations in general and, especially LMS analyses, are complex and require substantial computing time, even on advanced computer systems.

Moreover, a typical seismic survey may involve hundreds of sources and receivers, thus generating tremendous quantities of raw data. The data may be subjected to thousands of different data gathers. Each gather is subjected not only to filtering processes as described above, but in all likelihood to many other enhancement processes as well. For example, data is typically processed to compensate for the diminution in amplitude as a signal travels through the earth (“amplitude balancing”). Then, once the individual gathers have been filtered, they must be “stacked”, or compiled with other gathers, and subjected to further processing in order to make inferences about subsurface formations. Seismic processing by prior art Radon methods, therefore, requires substantial and costly computational resources, and there is a continuing need for more efficient and economical processing methods.

It is understood, of course, that the transformation, NMO correction, and various other mathematical processes used in seismic processing do not necessarily operate on all possible data points in the gather. Instead, and more typically, those processes may simply sample the data. For example, the transform functions in Radon transformations are based on variables t, x, τ, and p. The transformations, however, will not necessarily be performed at all possible values for each variable. Instead, the data will be sampled a specified number of times, where the number of samples for a particular variable may be referred to as the index for the variable set. For example, k, l, m, and j may be defined as the number of samples in, or the index of, respectively, the time (t), offset (x), tau (τ), and slowness (p) sets. The samples will be taken at specified intervals, Δt, Δx, Δt, and Δp. Those intervals are referred to as sampling variables.

The magnitude of the sampling variables, the variable domain and all other factors being equal, will determine the number of operations or samples that will be performed in the transformation and the accuracy of the transformation. As the sampling variables become finer, i.e., smaller, the number of samples increases and so does the accuracy. By making the sampling variables larger, or coarser, the number of samples is reduced, but the accuracy of the transformation is reduced as well.

In large part because of the computational intensity of those processes, however, the sampling variables used in prior art Radon processes can be relatively coarse. In NMO correction, for example, industry typically samples at Δt values several time greater than that at which the field data was recorded, i.e., in the range of 20-40 milliseconds, and samples at Δν values of from about 15 to about 120 m/sec. To the extent that the sampling variables are greater than the data acquisition sample rates, data is effectively discarded and the accuracy of the process is diminished. In the Radon transformation itself, prior art methods typically set Δt, Δτ, and Δx at the corresponding sample rates at which the data was recorded, i.e., in the range of 2 to 4 milliseconds and 25 to 400 meters or more, respectively. Δp is relatively coarse, however, typically being set at values in the range of 4-24 μsec/m. Also, the index j of the slowness (p) set usually is equal to the fold of the offset data, i.e., the number of source-receiver pairs in the survey, which typically ranges from about 20 to about 120.

Accordingly, prior art methods may rely on additional computations in an attempt to compensate for the loss of accuracy and resolution inherent in coarse sampling variables. For example, the LMS analysis applied in NMO correction and prior art Radon transformations are believed to obviate the need for finer sampling variables. Certain prior art processes utilize trace interpolation, thereby nominally reducing Δx values, but the additional “data” is an approximation of what would be recorded at a particular offsets between the offsets where receivers were actually located. Relative inaccuracy in processing individual data gathers also is believed to be acceptable because the data from a large number of gathers ultimately are combined for analysis, or “stacked”. Nevertheless, there also is a continuing need for more accurate processing of seismic data and processes having finer resolutions.

The velocity at which primary reflection signals are traveling, what is referred to as the stacking velocity, is used in various analytical methods that are applied to seismic data. For example, it is used in determining the depth and lithology or sediment type of geological formations in the survey area. It also is used various seismic attribute analyses. A stacking velocity function may be determined by what is referred to as a semblance analysis. Which such methods have provided reasonable estimations of the stacking velocity function for a data set, given the many applications based thereon, it is desirable to define the stacking velocity function as precisely as possible.

An object of this invention, therefore, is to provide a method for processing seismic data that more effectively removes unwanted noise from meaningful reflection signals.

It also is an object to provide such methods based on hyperbolic Radon transformations.

Another object of this invention is to provide methods for removal of noise from seismic data that are comparatively simple and require relatively less computing time and resources.

Yet another object is to provide methods for more accurately defining the stacking velocity function for a data set.

It is a further object of this invention to provide such methods wherein all of the above-mentioned advantages are realized.

Those and other objects and advantages of the invention will be apparent to those skilled in the art upon reading the following detailed description and upon reference to the drawings.

SUMMARY OF THE INVENTION

The subject invention provides for methods of processing seismic data to remove unwanted noise from meaningful reflection signals indicative of subsurface formations. The methods comprise the steps of obtaining field records of seismic data detected at a number of seismic receivers in an area of interest. The seismic data comprises signal amplitude data recorded over time by each of the receivers and contains both primary reflection signals and unwanted noise events. The seismic data is assembled into common geometry gathers in an offset-time domain.

The amplitude data is then transformed from the offset-time domain to the time-slowness domain using a Radon transformation. Preferably, the Radon transformation is applied within defined slowness limits p_(min) and p_(max), where p_(min) is a predetermined minimum slowness and p_(max) is a predetermined maximum slowness, and an offset weighting factor x^(n) is applied to the amplitude data, wherein 0<n<1.

Such Radon transformations include the following continuous transform equation, and discrete versions thereof that approximate the continuous transform equation: u(p, τ) = ∫_(−∞)^(∞)  x∫_(−∞)^(∞)t  (x, t)x^(n)δ[f(t, x, τ, p)]

Radon transformations based on linear slant stack, parabolic, and other non-hyperbolic kinematic travel time trajectories may be used, but those based on hyperbolic Radon kinematic trajectories are preferred. Suitable hyperbolic Radon transformations include the following continuous transform equation, and discrete versions thereof that approximate the continuous transform equation:

${u\left( {p,\tau} \right)} = {\int_{- \infty}^{\infty}\quad {{{xx}^{n}}{\left( {x,\sqrt{\tau^{2} + {p^{2}x^{2}}}} \right)}}}$

A high resolution Radon transformation preferably is used, where the transformation is performed according to an index j of the slowness set and a sampling, variable Δp; wherein ${j = \frac{p_{\max} - p_{\min} + {1\mu \quad \sec \text{/}m}}{\Delta \quad p}},$

Δp is from about 0.5 to about 4.0 μsec/m, p_(max) is a predetermined maximum slowness, and p_(min) is a predetermined minimum slowness.

A high-low and preferably, a time variant, high-low corrective filter is then applied to enhance the primary reflection signal content of the transformed data and to eliminate unwanted noise events. Preferably, the corrective filter is determined by reference to the velocity function derived from performing a semblance analysis or a pre-stack time migration analysis on the amplitude data.

After filtering, the enhanced signal content is inverse transformed from the time-slowness domain back to the offset-time domain using an inverse Radon transformation, and, if necessary, an inverse of the offset weighting factor p^(n) is applied to the inverse transformed data, wherein 0<n<1 Such Radon transformations include the following continuous inverse transform equation, and discrete versions thereof that approximate the continuous inverse transform equation:

d(x, t) = ∫_(−∞)^(∞)  p∫_(−∞)^(∞)τ  p^(n)ρ(τ) * u(p, τ)δ[g(t, x, τ, p)]

Suitable hyperbolic inverse Radon transformations include the following continuous inverse transform equation, and discrete versions thereof that approximate the continuous inverse transform equation:

${d\left( {x,t} \right)} = {\int_{- \infty}^{\infty}\quad {{{pp}^{n}}{\rho (\tau)}*{u\left( {p,\sqrt{t^{2} - {p^{2}x^{2}}}} \right)}}}$

The signal amplitude data for the enhanced signal content is thereby restored. The processed and filtered data may then be subject to further processing by which inferences about the subsurface geology of the survey area may be made.

It will be appreciated that the improved tau-P filters utilized in the subject invention more effectively enhance primary reflection signals and attenuate noise as compared to prior art Radon filters. The high-low filter is defined by reference to the velocity function for primary reflection signals, as determined, for example, through a semblance analysis. The velocity function and pass region will transform to a slowness function and pass region. Preferably, the slowness pass region is defined as:

$\frac{1}{v_{s}\left( {1 + r_{2}} \right)} \leq p \leq \frac{1}{v_{s}\left( {1 - r_{1}} \right)}$

where r₁, and r₂ are percentages expressed as decimals. The slowness limits typically are set within ±15%, preferably within ±10%, and most preferably within ±5% of the velocity function, and r₁ and r₂ maybe set accordingly.

Since the velocity function for the primary reflection signals is time variant, the filter limits preferably are time variant as well. In that manner, the filter may more closely fit the reflection's velocity function and, therefore, more effectively isolate primary reflection signals and water bottom reflection signals and remove multiple reflection signals and other noise. Moreover, since the strongest noise signals typically occur at velocities slower than primary reflection signals, it is preferable that ν_(min) lower limit more closely approximate the velocity function of the primary reflection signals.

It will be appreciated that primarily because they utilize high-low, and especially, time variant, high-low tau-P filters, and avoid more complex mathematical operations required by prior art processes, the novel methods provide enhanced filtering, yet require less total computation time and resources. Thus, even though hyperbolic Radon transformations heretofore have generally been avoided because of their greater complexity relative to linear slant stack and parabolic Radon transformations, the novel processes are able to more effectively utilize hyperbolic Radon transformations and take advantage of the greater accuracy they can provide, especially when applied to,common midpoint geometry gathers.

The subject invention also provides for methods for determining a stacking velocity function. The methods comprise the steps of processing and filtering the data as described above. A semblance analysis is performed on the restored data to generate a refined semblance plot, and a velocity analysis is performed on the refined semblance plot to define a refined stacking velocity function. Preferably, an offset weighting factor x^(n) is first applied to the restored amplitude data, wherein 0<n<1.

It will be appreciated that, because the semblance and velocity analysis is performed on data that has been more accurately processed and filtered, that the resulting stacking velocity function is more accurate. This enhances the accuracy of the many different seismic processing methods that utilize stacking velocity functions. Ultimately, the increased accuracy and efficiency of the novel processes enhances the accuracy of surveying underground geological features and, therefore, the likelihood of accurately locating the presence of oil and gas deposits.

BRIEF DESCRIPTION OF THE DRAWINGS

The patent or application file contains at least one drawing executed in color. Copies of this patent or patent application publication with color drawing(s) will be provided by the U.S. Patent and Trademark Office upon request and payment of the necessary fee.

FIG. 1 is a schematic diagram of a preferred embodiment of the methods of the subject invention showing a sequence of steps for enhancing the primary reflection signal content of seismic data and for attenuating unwanted noise events, thereby rendering it more indicative of subsurface formations.

FIG. 2 is a schematic diagram of a two-dimensional seismic survey in which field records of seismic data are obtained at a number of seismic receivers along a profile of interest.

FIG. 3 is a schematic diagram of a seismic survey depicting a common midpoint geometry gather.

FIG. 4 is a plot or display of model seismic data in the offset-time domain of a common midpoint gather containing overlapping primary reflections, a water-bottom reflection, and undesired multiple reflections.

FIG. 5 is a plot of the model seismic data of FIG. 4 after transformation to the time-slowness domain using a novel hyperbolic Radon transform in accordance with the subject invention that shows the separation of primary and water-bottom reflections from multiple reflections.

FIG. 6 is a plot or display in the offset-time domain of the model seismic data of FIG. 4 after applying a time variant, high-low filter in the time-slowness domain and inverse transforming the filtered data that shows the retention of primary and water-bottom reflections and the elimination of multiple reflections.

FIG. 7 is a plot in the offset-time domain of field records of seismic data recorded along a two-dimensional profile line in the West Texas region of the United States and assembled in a common midpoint geometry gather.

FIG. 8 is a plot in the offset-time domain of the seismic data of FIG. 7 after having been processed and filtered with a time variant, high-low filter in accordance with the subject invention.

FIG. 9 is a plot in the offset-time domain of data processed and filtered with a time variant, high-low filter according to the subject invention, including the data of FIG. 8, that have been stacked in accordance with industry practices.

FIG. 10 (prior art) is in contrast to FIG. 9 and shows a plot in the offset-time domain of unfiltered, conventionally processed data, including the unprocessed data of FIG. 7, that have been stacked in accordance with industry practices.

FIG. 11 is a plot in the offset-time domain of field records of seismic data recorded along a two-dimensional profile line in a West African production area and assembled in a common midpoint geometry gather.

FIG. 12 is a semblance plot of the seismic data of FIG. 11.

FIG. 13 is a plot in the offset-time domain of the seismic data of FIG. 11 after having been processed and filtered with a time variant, high-low filter in accordance with the subject invention.

FIG. 14 is a semblance plot of the processed seismic data of FIG. 13.

FIG. 15 is a plot in the offset-time domain of data processed and filtered with a time variant, high-low filter according to the subject invention, including the data of FIG. 13, that have been stacked in accordance with industry practices using a stacking velocity function determined from the semblance plot of FIG. 14.

FIG. 16 (prior art) is in contrast to FIG. 15 and shows a plot in the offset-time domain of unfiltered, conventionally processed data, including the unprocessed data of FIG. 11, that have been stacked in accordance with industry practices.

FIG. 17 is a plot in the offset-time domain of field records of seismic data recorded along a two-dimensional profile line in the Viosca Knoll region of the United States and assembled in a common midpoint geometry gather.

FIG. 18 is a semblance plot of the seismic data of FIG. 17.

FIG. 19 is a plot in the offset-time domain of the seismic data of FIG. 17 after having been processed and filtered with a time variant, high-low filter in accordance with the subject invention.

FIG. 20 is a semblance plot of the processed seismic data of FIG. 19.

FIG. 21 is a plot in the offset-time domain of data processed and filtered with a time variant, high-low filter according to the subject invention, including the data of FIG. 19, that has been stacked in accordance with industry practices using a stacking velocity function determined from the semblance plot of FIG. 20.

FIG. 21A is an enlargement of the area shown in box 21A of FIG. 21.

FIG. 22 (prior art) is in contrast to FIG. 21 and shows a plot in the offset-time domain of data, including the data of FIG. 17, that was processed and filtered in accordance with conventional parabolic Radon methods and then stacked in accordance with industry practices.

FIG. 22A (prior art) is an enlargement of the area shown in box 22A of FIG. 22.

DESCRIPTION OF ILLUSTRATIVE EMBODIMENTS

The subject invention is directed to improved methods for processing seismic data to remove unwanted noise from meaningful reflection signals and for more accurately determining the stacking velocity function for a set of seismic data.

Obtaining and Preparing Seismic Data for Processing

More particularly, the novel methods comprise the step of obtaining field records of seismic data detected at a number of seismic receivers in an area of interest. The seismic data comprises signal amplitude data recorded over time and contains both primary reflection signals and unwanted noise events.

By way of example, a preferred embodiment of the methods of the subject invention is shown in the flow chart of FIG. 1. As shown therein in step 1, seismic amplitude data is recorded in the offset-time domain. For example, such data may be generated by a seismic survey shown schematically in FIG. 2.

The seismic survey shown in FIG. 2 is a two-dimensional survey in offset-time (X-T) space along a seismic line of profile L. A number of seismic sources S_(n) and receivers R_(n) are laid out over a land surface G along profile L. The seismic sources S_(n) are detonated in a predetermined sequence. As they are discharged, seismic energy is released as energy waves. The seismic energy waves or “signals” travel downward through the earth where they encounter subsurface geological formations, such as formations F₁ and F₂ shown schematically in FIG. 2. As they do, a portion of the signal is reflected back upwardly to the receivers R_(n). The paths of such primary reflection signals from S₁ to the receivers R_(n) are shown in FIG. 2.

The receivers R_(n) sense the amplitude of incoming signals and digitally record the amplitude data over time for subsequent processing. Those amplitude data recordations are referred to as traces. It will be appreciated that the traces recorded by receivers R_(n) include both primary reflection signals of interest, such as those shown in FIG. 2, and unwanted noise events.

It also should be understood that the seismic survey depicted schematically in FIG. 2 is a simplified one presented for illustrative purposes. Actual surveys typically include a considerably larger number of sources and receivers. Further, the survey may taken on land or over a body of water. The seismic sources usually are dynamite charges if the survey is being done on land, and geophones are used. Air guns are typically used for marine surveys along with hydrophones. The survey may also be a three-dimensional survey over a surface area of interest rather than a two-dimensional survey along a profile as shown.

In accordance with the subject invention, the seismic data is assembled into common geometry gathers in an offset-time domain. For example, in step 2 of the preferred method of FIG. 1, the seismic amplitude data is assembled in the offset-time domain as a common midpoint gather. That is, as shown schematically in FIG. 3, midpoint CMP is located halfway between source s₁ and receiver r₁. Source S₂ and receiver r₂ share the same midpoint CMP, as do all pairs of sources s_(n) and receivers r_(n) in the survey. Thus, it will be appreciated that all source s_(n) and receiver r_(n) pairs are measuring single points on subsurface formations F_(n). The traces from each receiver r_(n) in those pairs are then assembled or “gathered” for processing.

It will be appreciated that the field data may be processed by other methods for other purposes before being processed in accordance with the subject invention as shown in step 3 of FIG. 1. The appropriateness of first subjecting the data to amplitude balancing or other conventional pre-processing, such as spherical divergence correction and absorption compensation, will depend on various geologic, geophysical, and other conditions well known to workers in the art. The methods of the subject invention may be applied to raw, unprocessed data or to data preprocessed by any number of well-known methods.

As will become apparent from the discussion that follows, however, it is important that the data not be NMO corrected, or if preprocessed by a method that relies on NMO correction, that the NMO correction be reversed, prior to transformation of the data. Otherwise, it is not practical to design and apply the high-low filters of the subject invention. Importantly, however, because the methods of the subject invention do not contemplate the use of NMO correction, the overall efficiency of the novel processes is improved. NMO correction requires an LMS analysis and typically is followed by another LMS analysis in the Radon transformation, both of which require a large number of computations. It also is possible to avoid the loss of resolution caused by the use of coarse sampling variables in NMO correcting.

Transformation of Data

Once the data is assembled, the methods of the subject invention further comprise the step of transforming the offset weighted amplitude data from the offset-time domain to the time-slowness domain using a Radon transformation. Preferably, an offset weighting factor x^(n) is applied to the amplitude data to equalize amplitudes in the seismic data across offset values and to emphasize normal amplitude moveout differences between desired reflection signals and unwanted noise, wherein 0<n<1.

It also is preferred that the Radon transformation be applied within defined slowness limits p_(min) and p_(max), where p_(min) is a predetermined minimum slowness and p_(max) is a predetermined maximum slowness. By limiting the transformation in that manner, it is more efficient and effective. The slowness limits p_(min and p) _(max) preferably are determined by reference to a velocity function derived by performing a semblance analysis or a pre-stack time migration analysis on the amplitude data.

The transformation also is preferably performed with a high resolution Radon transformation having an index j of the slowness set and a sampling variable Δp, wherein ${j = \frac{p_{\max} - p_{\min} + {1\mu \quad \sec \text{/}m}}{\Delta \quad p}},$

Δp is from about 0.5 to about 4.0 μsec/m, p_(max) is a predetermined maximum slowness, and p_(min) is a predetermined minimum slowness. This provides a finer resolution transformation and, therefore, better resolution in the filtered data.

For example, in step 4 of the exemplified method of FIG. 1, an offset weighting factor is applied to the data that was assembled in step 2. A semblance analysis is performed on the offset weighted amplitude data to generate a semblance plot, as shown in step 6. Then, in step 17 the semblance plot is used to define the slowness limits p_(min) and p_(max) that will be applied to the transformation. The offset weighted data is then transformed with a high resolution hyperbolic Radon transformation according to the transform limits in step 5. It will be appreciated, however, that the Radon transformation of the offset weighted data may be may be based on linear slant stack, parabolic, or other non-hyperbolic kinematic travel time trajectories.

The slowness transformation limits p_(min) and p_(max) are defined by reference to the velocity function for primary reflection signals as determined, for example, through the semblance analysis described above. High and low transformation limits, i.e., a maximum velocity (ν_(max)) and minimum velocity (ν_(min)), are defined on either side of the velocity function. The velocity limits then are converted into slowness limits p_(min) and p_(max) which will limit the slowness domain for the transformation of the data from the offset-time domain to the tau-P domain, where p_(min)=1/ν_(max) and p_(max)=1/ν_(min).

When the semblance analysis is performed on amplitude data that has been offset weighted, as described above, appropriate slowness limits p_(min) and p_(max) may be more accurately determined and, therefore, a more efficient and effective transformation may be defined. It will be appreciated, however, that the semblance analysis may be performed on data that has not been offset weighted. Significant improvements in computational efficiency still will be achieved by the subject invention.

In general, p_(max) is greater than the slowness of reflection signals from the shallowest reflective surface of interest. In marine surveys, however, it typically is desirable to record the water bottom depth. Thus, p_(max) may be somewhat greater, ie., greater than the slowness of reflective signals through water in the area of interest. The lower transformation limit, p_(min), generally is less than the slowness of reflection signals from the deepest reflective surface of interest. Typically, the upper and lower transformation limits p_(min) and p_(max) will be set within 20% below (for lower limits) or above (for upper limits) of the slownesses of the pertinent reflection signals, or more preferably, within 10% or 5% thereof While the specific values will depend on the data recorded in the survey, therefore, p_(min) generally will be less than about 165 μsec/m and, even more commonly, less than about 185 μsec/m. Similarly, p_(max) generally will be greater than about 690 μsec/m, and even more commonly, greater than about 655 μsec/m for marine surveys. For land surveys, p_(max) generally will be greater than about 3,125 μsec/m, and even more commonly, greater than about 500 μsec/m.

The use and advantages of limited Radon transformations are more completely disclosed in the application of John M. Robinson, Rule 47(b) Applicant, entitled “Removal of Noise From Seismic Data Using Limited Radon Transformations”, U.S. Ser. No. TBA, filed Sep. 10, 2002, the disclosure of which is hereby incorporated by reference. It will be appreciated, however, that by limiting the transformation, novel methods usually will be made more efficient, by reducing the amount of data transformed, and more effective, by decimating the noise signals that fall outside those limits. It is not necessary, however, that effective slowness limits, either lower limits p_(min) or upper limits p_(max), be placed on the transformation. Significant benefits still will be obtained by practicing the subject invention as described and claimed herein.

A general mathematical formulation utilizing the offset weighting factor and encompassing the linear, parabolic, and hyperbolic forward Radon transforms is as follows: $\begin{matrix} {{{u\left( {p,\tau} \right)} = {\int_{- \infty}^{\infty}{{x}{\int_{- \infty}^{\infty}{{t}{\left( {x,t} \right)}x^{n}{\delta \left\lbrack {f\left( {t,x,\tau,p} \right)} \right\rbrack}}}}}}\left( {{forward}\quad {transformation}} \right)} & (1) \end{matrix}$

where

u(p,τ)=transform coefficient at slowness p and zero-offset time

τd(x,t) measured seismogram at offset x and two-way time t

x^(n)=offset weighting factor (0<n<1)

δ=Dirac delta function

ƒ(t,x,τ,p)=forward transform function

The forward transform function for hyperbolic trajectories is as follows:

ƒ(t,x,τ,p)=t−{square root over (τ²+p²x²)}

Thus, when t={square root over (τ²+p²x²)}, the forward hyperbolic Radon transformation equation becomes ${u\left( {p,\tau} \right)} = {\int_{- \infty}^{\infty}{{{xx}^{n}}{\left( {x,\sqrt{\tau^{2} + {p^{2}x^{2}}}} \right)}}}$

The forward transform function for linear slant stack kinematic trajectories is as follows:

ƒ(t,x,τ,p)=t−τ−px

Thus, when t=τ+px, the forward linear slant stack Radon transformation equation becomes u(p, τ) = ∫_(−∞)^(∞)xx^(n)(x, τ + px)

The forward transform function for parabolic trajectories is as follows:

ƒ(t,x,τ,p)=t−τ−px ²

Thus, when t=τ+px², the forward parabolic Radon transformation equation becomes u(p, τ) = ∫_(−∞)^(∞)xx^(n)(x, τ + px²)

As with conventional Radon transformations, the function ƒ(t,x,τ,p) allows kinematic travel time trajectories to include anisotropy, P-S converted waves, wave-field separations, and other applications of current industry that are used to refine the analysis consistent with conditions present in the survey area. Although hyperbolic travel time trajectories represent more accurately reflection events for common midpoint gathers in many formations, hyperbolic Radon transformations to date have not been widely used. Together with other calculations necessary to practice prior art processes, the computational intensity of hyperbolic Radon transforms tended to make such processing more expensive and less accurate. Hyperbolic Radon transformations, however, are preferred in the context of the subject invention because the computational efficiency of the novel processes allows them to take advantage of the higher degree of accuracy provided by hyperbolic travel time trajectories.

It will be noted, however, that the novel Radon transformations set forth above in Equation 1 differ from conventional Radon transformations in the application of an offset weighting factor x^(n), where x is offset. The offset weighting factor emphasizes amplitude differences that exist at increasing offset, i.e., normal amplitude moveout differences between desired primary reflections and multiples, linear, and other noise whose time trajectories do not fit a defined kinematic function. Since the offset is weighted by a factor n that is positive, larger offsets receive preferentially larger weights. The power n is greater than zero, but less than 1. Preferably, n is approximately 0.5 since amplitudes seem to be preserved better at that value. While the power n appears to be robust and insensitive, it probably is data dependent to some degree.

While the application of an offset weighting factor as described above is preferred, it will be appreciated that other methods of amplitude balancing may be used in the methods of the subject invention. For example, automatic gain control (AGC) operators may be applied. A gain control operator may be applied where the gain control operator is the inverse of the trace envelope for each trace as disclosed in U.S. Pat. No. 5,189,644 to Lawrence C. Wood and entitled “Removal of Amplitude Aliasing Effect From Seismic Data”.

As will be appreciated by workers in the art, execution of the transformation equations discussed above involve numerous calculations and, as a practical matter, must be executed by computers if they are to be applied to the processing of data as extensive as that contained in a typical seismic survey. Accordingly, the transformation equations, which are expressed above in a continuous form, preferably are translated into discrete transformation equations which approximate the solutions provided by continuous transformation equations and can be encoded into and executed by computers.

For example, assume a seismogram d(x,t) contains 2L+1 traces each having N time samples, i.e.,

l=0,±1, . . . ,±L and

k=1, . . . , N

and that

x _(−L) <x _(−L+1) < . . . <x _(L−1) <x _(L)

A discrete general transform equation approximating the continuous general transform Equation 1 set forth above, therefore, may be derived as set forth below: $\begin{matrix} {{u\left( {p,\tau} \right)} = {\sum\limits_{l = {- L}}^{L}\quad {\sum\limits_{k = 1}^{N}\quad {{d\left( {x_{1},t_{k}} \right)}x_{1}^{n}{\delta \left\lbrack {f\left( {t_{k},x_{1},\tau,p} \right)} \right\rbrack}\Delta \quad x_{l}\Delta \quad t_{k}}}}} & (2) \end{matrix}$

where ${{\Delta \quad x_{1}} = {{\frac{x_{l + 1} - x_{l - 1}}{2}\quad {for}\quad l} = 0}},{\pm 1},\ldots \quad,\quad {\pm \left( {L - 1} \right)}$

Δx _(L) =x _(L) −x _(L−1)

Δx _(−L) =x _(−L+1) −x _(L−1)

${{\Delta \quad t_{k}} = {{\frac{t_{k + 1} - l_{k - 1}}{2}\quad {for}\quad k} = 2}},\ldots \quad,{N - 1}$

Δf ₁ =t ₂ −t ₁

Δt _(n) =t _(n) −t _(n −1)

By substituting the hyperbolic forward transform function set forth above, the discrete general forward transformation Equation 2 above, when t={square root over (τ²+p² x²)}, may be reduced to the discrete transformation based on hyperbolic kinematic travel time trajectories that is set forth below: ${u\left( {p,\tau} \right)} = {\sum\limits_{l = {- L}}^{L}\quad {x_{l}^{n}{d\left( {x_{l},\sqrt{\tau^{2} + {p^{2}x_{l}^{2}}}} \right)}\Delta \quad x_{l}}}$

Similarly, when t=τ+px, the discrete linear slant stack forward transformation derived from general Equation 2 is as follows: ${u\left( {p,\tau} \right)} = {\sum\limits_{l = {- L}}^{L}\quad {x_{l}^{n}{d\left( {x_{l},{\tau + {px}_{l}}} \right)}\Delta \quad x_{l}}}$

when t=τ+px², the discrete parabolic forward transformation is as follows: ${u\left( {p,\tau} \right)} = {\sum\limits_{l = {- L}}^{L}\quad {x_{l}^{n}{d\left( {x_{l},{\tau + {px}_{l}^{2}}} \right)}\Delta \quad x_{l}}}$

Those skilled in the art will appreciate that the foregoing discrete transformation Equation 2 sufficiently approximates continuous Equation 1, but still may be executed by computers in a relatively efficient manner. For that reason, the foregoing equation and the specific cases derived therefrom are preferred, but it is believed that other discrete transformation equations based on Radon transformations are known, and still others may be devised by workers of ordinary skill for use in the subject invention.

Preferably, as noted above, the data is transformed with a high resolution Radon transformation according to an index j of the slowness set and a sampling variable Δp, wherein ${j = \frac{p_{\max} - p_{\min} + {1{\mu sec}\text{/}m}}{\Delta \quad p}},$

p_(max) is a predetermined maximum slowness, and p_(min) is a predetermined minimum slowness. More specifically, Δp typically is from about 0.5 to about 4.0 μsec/m. Δp preferably is from about 0.5 to about 3.0 μsec/m, and more preferably, is from about 0.5 to about 2.0 μsec/m. A Δp of about 1.0 μsec/m is most preferably used. Slowness limits p_(min) and p_(max) which are used to determine the index j of the slowness set, are generally set in the same manner as the slowness limits that preferably are applied to limit the transformation as described above. The specific values for the slowness limits p_(min) and p_(max) will depend on the data recorded in the survey, but typically, therefore, j preferably is from about 125 to about 1000, most preferably from about 250 to about 1000.

Such values are significantly finer than prior art Radon processes, and to that extent, will provide increased accuracy in the filtering of the data. Thus, while lower resolution transforms may be used, the methods of the subject invention preferably incorporate a high resolution Radon transformation. The use and advantages of high resolution Radon transformations are more completely disclosed in the application of John M. Robinson, Rule 47(b) Applicant, entitled “Removal of Noise From Seismic Data Using High Resolution Radon Transformations”, U.S. Ser. No. TBA, filed Sep. 10, 2002, the disclosure of which is hereby incorporated by reference.

Filtering of Data

The methods of the subject invention further comprise the step of applying a high-low corrective filter, and preferably a time variant, high-low corrective filter to enhance the primary reflection signal content of the data and to eliminate unwanted noise events. Preferably, the corrective filter is determined by performing a semblance analysis on the amplitude data to generate a semblance plot and performing a velocity analysis on the semblance plot to define a stacking velocity function and the corrective filter. Alternately, the corrective filter may be determined by performing a pre-stack time migration analysis on the amplitude data to define a velocity function and the corrective filter.

For example, in step 6 of the preferred method of FIG. 1, a semblance analysis is performed on the offset weighted amplitude data to generate a semblance plot. Then, in step 7 a velocity analysis is performed on the semblance plot to define a stacking velocity function and a time variant, high-low corrective filter. The corrective filter then is applied to the transformed data as shown in step 8.

When the semblance analysis is performed on amplitude data that has been offset weighted, as described above, the resulting velocity analysis will be more accurate and, therefore, a more effective filter may be defined. It will be appreciated, however, that the semblance analysis may be performed on data that has not been offset weighted. Significant improvements in accuracy and computational efficiency still will be achieved by the subject invention.

The high-low filter is defined by reference to the velocity function for primary reflection signals, as determined, for example, through the semblance analysis described above. The stacking velocity function, [t_(o),ν_(s)(t_(o))], describes the velocity of primary reflections signals as a function of t_(o). High and low filter limits, i.e., a maximum velocity, ν_(max)(t_(o)), and a minimum velocity, ν_(min)(t_(o)), are defined on either side of the velocity function, for example, within given percentages of the velocity function. In such cases, the velocity pass region at a selected time t_(o) corresponds to ν_(s)(1−r₁)≦ν≦ν_(s) (1+r₂), where r₁ and r₂ are percentages expressed as decimals. The velocity function will transform to a slowness function, [τ,p(τ)], in the tau-P domain. Similarly, the velocity pass region will map into a slowness pass region, namely: $\frac{1}{v_{s}\left( {1 + r_{2}} \right)} \leq p \leq \frac{1}{v_{s}\left( {1 - r_{1}} \right)}$

for application to the transformed data in the tau-P domain. The slowness limits typically are set within ±15%, preferably within ±10%, and most preferably within ±5% of the velocity function, and r₁ and r₂ may be set accordingly.

Since the velocity function for the primary reflection signals is time variant, the filter limits preferably are time variant as well. In that manner, the filter may more closely fit the reflection's velocity function and, therefore, more effectively isolate primary reflection signals and water bottom reflection signals and remove multiple reflection signals and other noise. Moreover, since the strongest noise signals typically occur at velocities slower than primary reflection signals, it is preferable that ν_(min) lower limit more closely approximate the velocity function of the primary reflection signals.

It will be appreciated, however, that one or both of the upper or lower filter limits may, if desired, be made time invariant. Although such filters in general will not enhance the primary signal content or attenuate noise as effectively as a suitably designed filter where both the upper and lower limits are time variant, they may be adapted for use in the subject invention.

In contrast to prior art Radon methods that rely on mute filters and subtraction processes, the methods and filters of the subject invention are more effective. Mute filters are applied to all data below a defined, time invariant slowness value p_(mute) greater than the slownesses of the primary reflections. The slowness of the primary reflections is essentially zero when data is NMO corrected prior to transformation, so p_(mute) typically is set relatively close to zero. Nevertheless, while most of the multiple reflections signals will have slowness greater than p_(mute) and, therefore, ultimately will be subtracted from the data, the near trace reflection signals that are muted and remain in the data after subtraction can have greater amplitude than the primary signals. They also represent a disproportionately greater share of the total amplitude of the reflection signals. To that extent, then, mute filters are ineffective in removing multiple reflection signals.

Moreover, since such prior art methods typically subject the data to NMO correction prior to transforming the data, it is not possible to apply a high-low mute filter. Primary reflection signals transform at zero slowness when the data has been NMO corrected. Thus, the application of any lower mute limit, other than zero, would not mute the primary signals. They would be preserved in the tau-P domain along with multiples and therefore, subtracted along with the multiples from the original data set in the time-space domain. In essence, the primary signals would be filtered out by any lower mute limit.

The methods of the subject invention, however, are more effective at filtering all multiples, including those recorded at near offsets. When the data is not subject to NMO correction, signals for multiple reflection events, including those recorded at near traces, will transform into regions of greater slownesses than those for primary signals, i.e., above a definable p_(max). They then will be filtered out, along with other noise at greater slownesses, by the upper limit p_(max) of the novel filters. Moreover, because primary reflection signals do not transform at or near zero slowness, i.e., they transform above a definable p_(min), the filters of the subject invention are able to remove noise transforming below p_(min).

Finally, it will be appreciated that while the subject invention contemplates the application of a filter to the transformed data in the tau-P domain, additional filters may be applied to the data in the time-space domain before or after application of the Radon transformations, or in other domains by other filtration methods, if desired or appropriate.

The design of a corrective filter is guided by the following principles. Seismic waves can be analyzed in terms of plane wave components whose arrival times in X-T space are linear. Seismic reflection times are approximately hyperbolic as a function of group offset X in the following relations: $t_{x}^{2} = {t_{o}^{2} + \frac{x^{2}}{v_{s}^{2}}}$

where

x is the group offset,

t_(x) is the reflection time at offset x;

t_(o) is the reflection time at zero offset; and

ν_(s) is the stacking velocity.

The apparent surface velocity of a reflection at any given offset relates to the slope of the hyperbola at that offset. Those slopes, and thus, the apparent velocities of reflections are bounded between infinite velocity at zero offset and the stacking velocity at infinite offset. Noise components, however, range from infinite apparent velocity to about one-half the speed of sound in air.

Impulse responses for each Radon transform can be readily calculated by setting (t, x,τ₁,p₁)=0 or ƒ(t₁,x₁,τ, p)=0 in the respective domains, for example, by substituting a single point sample such as (x₁,t₁,) or (τ₁,p₁,) in each domain. Substituting

d(x ₁ ,t ₁)=Aδ(x−x ₁)δ(t−t ₁)

into the linear slant stack equation yields

u(p,τ)=Aδ(t ₁ −τ−px ₁).

Thus it shows that a point of amplitude A at (x₁,t₁) maps into the straight line

τ+px ₁ =t ₁.

On the other hand, substituting (p₁,τ₁) of amplitude B yields

u(p,τ)=Bδ(τ₁ −t+p ₁ x)

showing that a point (p₁,τ₁) in tau-P space maps into the line

τ₁ =t−p ₁ x.

In a similar manner it can be shown that a hyperbola $t^{2} = {t_{1}^{2} + \frac{x^{2}}{v^{2}}}$

maps into the point

(τ,p)=(t ₁,1/ν),

and vice-versa.

In the practice of the subject invention a point (x₁,t₁) maps into the ellipse $1 = {\frac{\tau^{2}}{t_{1}^{2}} + \frac{p^{2}x_{1}^{2}}{t_{1}^{2}}}$

(X-T domain impulse response) under the hyperbolic Radon transform. Thus, hyperbolas representing signals map into points.

In addition straight lines

t=mx

representing organized source-generated noise also map into points

(τ,p)=(o,m)

in the tau-P domain. These properties form the basis for designing tau-P filters that pass signal and reject noise in all common geometry domains.

In summary then, in a common midpoint gather prior to NMO correction, the present invention preserves the points in tau-P space corresponding to the hyperbolas described by the stacking velocity function (t₁,ν), where ν is the dip corrected stacking velocity. A suitable error of tolerance such as 5-20% is allowed for the stacking velocity function. Similar procedures exist for each of the other gather geometries.

The signal's characterization is defined by the Canonical equations that are used to design two and three dimensional filters in each common geometry gather. Filters designed to pass signal in the tau-P domain for the common geometry gathers for both two-and-three dimensional seismic data are derived from the following basic considerations. In the X-T domain the kinematic travel time for a primary reflection event's signal in a common midpoint (“CMP”) gather is given by the previously described hyperbolic relationship $t_{x}^{2} = {t_{o}^{2} + \frac{x^{2}}{v_{s}^{2}}}$

Under the hyperbolic Radon transformation, this equation becomes

t _(x) ²=τ² +p ² x ².

The source coordinate for two-dimensional seismic data may be denoted by I (Initiation) and the receiver coordinate by R (receiver) where τ=t_(o) and p=1/ν_(s). The signal slowness in the tau-P domain for common source data is given by ${\frac{\partial t_{x}}{\partial R}_{I = I_{o}}} = {\frac{{\partial t_{x}}{\partial C}}{{\partial C}{\partial R}} + \frac{{\partial t}{\partial x}}{{\partial x}{\partial R}}}$

where the CMP coordinate (C) and offset (x) are as follows: $C = \frac{I + R}{2}$

 x=R−I

Defining common source slowness (p_(R)), common offset slowness (p_(c)), and common midpoint slowness (p_(x)) as follows: $\begin{matrix} {P_{R} = {\frac{\partial t_{x}}{\partial R}_{I}}} \\ {P_{C} = {\frac{\partial t_{x}}{\partial C}_{X}}} \\ {P_{x} = {\frac{\partial t_{x}}{\partial x}_{C}}} \end{matrix}$

we obtain a general (canonical) relationship for signal slowness in the tau-P domain: $P_{R} = {{\frac{1}{2}P_{C}} + P_{x}}$

Common offset slowness p_(c) is given by $P_{C} = {\frac{{\partial t_{x}}{\partial t_{o}}}{{\partial t_{o}}{\partial C}} = {\frac{\partial t_{x}}{\partial t_{o}}p_{o}}}$

where p_(o) is the slowness or “dip” on the CMP section as given by $p_{o} = \frac{\partial t_{o}}{\partial C}$

Since ${t_{x}^{2} = {t_{o}^{2} + \frac{x^{2}}{v_{s}^{2}}}},$

we obtain ${\frac{\partial t_{x}}{\partial t_{o}} = {\frac{t_{o}}{t_{x}} - \frac{x^{2}a}{t_{s}v_{s}^{3}}}},$

where acceleration (a) $a = {\frac{\partial v_{s}}{\partial t_{o}}.}$

Thus, we obtain that common offset slowness (p_(c)) $p_{C} = {p_{o}\frac{t_{o}}{t_{x}}{\left( {1 - \frac{{ax}^{2}}{t_{o}v_{s}^{3}}} \right).}}$

Under a hyperbolic Radon transformation where

τ=t _(o)

t _(x)={square root over (τ² p ² x ²)},

we determine that the common midpoint slowness (p_(x)), common source slowness (p_(R)), common receiver slowness (p₁), and common offset slowness (p_(c)) may be defined as follows: $\begin{matrix} {p_{x} = \frac{x}{v_{s}^{2}\sqrt{\tau^{2} + {p^{2}x^{2}}}}} \\ {p_{R} = {{\frac{1}{2}p_{C}} + p_{x}}} \\ {p_{1} = {{\frac{1}{2}p_{C}} - p_{x}}} \\ {p_{C} = {p_{o}\frac{\tau}{\sqrt{\tau^{2} + {p^{2}x^{2}}}}\left( {1 - \frac{{ax}^{2}}{t_{o}v_{s}^{3}}} \right)}} \end{matrix}$

In common source, receiver and offset gathers, the pass regions or filters in tau-P space are defined as those slowness (p's) not exceeding specified percentages of slownesses P_(R), p₁, and p_(c), respectively: $\begin{matrix} {p \leq {\left( \frac{1}{1 + r_{3}} \right)p_{R}}} & \left( {{common}\quad {source}} \right) \\ {p \leq {\left( \frac{1}{1 + r_{4}} \right)p_{l}}} & \left( {{common}\quad {receiver}} \right) \\ {p \leq {\left( \frac{1}{1 + r_{5}} \right)p_{C}}} & \left( {{common}\quad {offset}} \right) \end{matrix}$

where r₃, r₄, and r₅, are percentages expressed as decimals. Slownesses p_(R), p₁, and p_(c), are expressed, respectively, as follows: $\begin{matrix} {p_{R} = {{\frac{1}{2}p_{C}} + p_{x}}} & \left( {{common}\quad {source}} \right) \\ {p_{l} = {{\frac{1}{2}p_{C}} - p_{x}}} & \left( {{common}\quad {receiver}} \right) \\ {p_{C} = {\frac{t_{o}}{t_{x}}{p_{x}\left( {1 - \frac{{ax}^{2}}{t_{o}v_{s}^{3}}} \right)}}} & \left( {{common}\quad {offset}} \right) \end{matrix}$

where $\begin{matrix} {p_{x} = \frac{x}{t_{x}v_{s}^{2}}} & \quad \\ {a = \frac{\partial v_{s}}{\partial t_{o}}} & \left( {{velocity}\quad {acceleration}} \right) \\ {p_{o} = \frac{\partial t_{o}}{\partial C}} & \left( {{dip}\quad {on}\quad {CMP}\quad {stack}} \right) \\ {t_{x} = \sqrt{t_{o}^{2} + \frac{x^{2}}{v_{s}^{2}}}} & \quad \\ {\tau = t_{o}} & \quad \end{matrix}$

The value for offset x in these equations is the worse case maximum offset determined s by the mute function.

Inverse Transforming the Data

After the corrective filter is applied, the methods of the subject invention further comprise the steps of inverse transforming the enhanced signal content from the time-slowness domain back to the offset-time domain using an inverse Radon transformation. If, as is preferable, an offset weighting factor x^(n) was applied to the transformed data, an inverse of the offset weighting factor p^(n) is applied to the inverse transformed data. Similarly, if other amplitude balancing operators, such as an AGC operator or an operator based on trace envelopes, were applied, an inverse of the amplitude balancing operator is applied. The signal amplitude data is thereby restored for the enhanced signal content.

For example, in step 9 of the method of FIG. 1, an inverse hyperbolic Radon transformation is used to inverse transform the enhanced signal from the time-slowness domain back to the offset-time domain. An inverse of the offset weighting factor p^(n) then is applied to the inverse transformed data, as shown in step 10. The signal amplitude data for the enhanced signal content is thereby restored.

A general mathematical formulation utilizing the inverse offset weighting factor and encompassing the linear, parabolic, and hyperbolic inverse Radon transforms is as follows: $\begin{matrix} {{{d\left( {x,t} \right)} = {\int_{- \infty}^{\infty}\quad {{p}{\int_{- \infty}^{\infty}\quad {{\tau}\quad p^{n}{\rho (\tau)}*{u\left( {p,\tau} \right)}{\delta \left\lbrack {g\left( {t,x,\tau,p} \right)} \right\rbrack}}}}}}\quad \left( {{inverse}\quad {transformation}} \right)} & (3) \end{matrix}$

where

u(p,τ)=transform coefficient at slowness p and zero-offset time

τd(x,t)=measured seismogram at offset x and two-way time t

p^(n)=inverse offset weighting factor (0<n<1)

ρ(τ)*=convolution of rho filter

δ=Dirac delta function

g(t,x,τ,p)=inverse transform function

The inverse transform function for hyperbolic trajectories is as follows:

g(t,x,τ,p)=τ−{square root over (t ² −p ² x ²)}

Thus, when τ={square root over (t²−p²x²)}, the inverse hyperbolic Radon transformation equation becomes ${d\left( {x,t} \right)} = {\int_{- \infty}^{\infty}\quad {{{pp}^{n}}{\rho (\tau)}*{u\left( {p,\sqrt{t^{2} - {p^{2}x^{2}}}} \right)}}}$

The inverse transform function for linear slant stack trajectories is as follows:

g(t,x,τ,p)=τ−t+px

Thus, when τ=t−px, the inverse linear slant stack Radon transformation equation becomes d(x, t) = ∫_(−∞)^(∞)  pp^(n)ρ(τ) * u(p, t − px)

The inverse transform function for parabolic trajectories is as follows:

g(t,x,τ,p)=τ−t+px ²

Thus, when τ=t−px², the inverse parabolic Radon transformation equation becomes d(x, t) = ∫_(−∞)^(∞)  pp^(n)ρ(τ) * u(p, t − px²)

As with the forward transform function ƒ(t,x,τ,p) in conventional Radon transformations, the inverse travel-time function g(t,x,τ,p) allows kinematic travel time trajectories to include anisotropy, P-S converted waves, wave-field separations, and other applications of current industry that are used to refine the analysis consistent with conditions present in the survey area. It will be noted, however, that the novel inverse Radon transformations set forth above in Equation 3 differ from conventional inverse Radon transformations in the application of an inverse offset weighting factor p^(n), where p is slowness.

The inverse offset weighting factor restores the original amplitude data which now contains enhanced primary reflection signals and attenuated noise signals. Accordingly, smaller offsets receive preferentially larger weights since they received preferentially less weighting prior to filtering. The power n is greater than zero, but less than 1. Preferably, n is approximately 0.5 because amplitudes seem to be preserved better at that value. While the power n appears to be robust and insensitive, it probably is data dependent to some degree.

As discussed above relative to the forward transformations, the continuous inverse transformations set forth above preferably are translated into discrete transformation equations which approximate the solutions provided by continuous transformation equations and can be encoded into and executed by computers.

In For example, assume a transform coefficient u(p,τ) contains 2J+1 discrete values of the parameter p and M discrete values of the parameter τ, ie.,

j=0,±1, . . . ,±J and

m=1, . . . ,M

and that

p _(−j) <p _(−j+1) < . . . <p _(j−1) <p _(j)

A discrete general transform equation approximating the continuous general transform Equation 3 set forth above, therefore, may be derived as set forth below: $\begin{matrix} {{d\left( {x,t} \right)} = {\sum\limits_{J = {- J}}^{J}\quad {\sum\limits_{m = 1}^{M}\quad {{u\left( {p_{j},\tau_{m}} \right)}p_{j}^{n}{\rho (\tau)}*{\delta \left\lbrack {g\left( {t,x,\tau_{m},p_{j}} \right)} \right\rbrack}\Delta \quad p_{j}{\Delta\tau}_{m}}}}} & (4) \end{matrix}$

where ${{\Delta \quad p_{j}} = {{\frac{p_{j + 1} - p_{j - 1}}{2}\quad {for}\quad j} = 0}},{\pm 1},\ldots \quad,{\pm \left( {J - 1} \right)}$

Δp_(j)=p_(j)−p_(j−1)

Δp_(−j)=p_(−j+1)−p_(−j) ${{\Delta\tau}_{m} = {{\frac{\tau_{m + 1} - \tau_{m - 1}}{2}\quad {for}\quad m} = 2}},\ldots \quad,{M - 1}$

Δτ₁=τ₂−τ₁

Δτ_(m)=τ_(m)−τ_(m−1)

By substituting the hyperbolic inverse transform function set forth above, the 27 discrete general inverse transformation Equation 4 above, when τ={square root over (t²−p²x²)}, may be reduced to the discrete inverse transformation based on hyperbolic kinematic travel time trajectories that is set forth below: ${d\left( {x,t} \right)} = {\sum\limits_{j = {- J}}^{J}{p_{j}^{n}{\rho (\tau)}*{u\left( {p_{j},\sqrt{t^{2} - {p_{j}^{2}x^{2}}}} \right)}\Delta \quad p_{j}}}$

Similarly, when τ=t−px, the discrete linear slant stack inverse transformation derived from the general Equation 4 is as follows: ${d\left( {x,t} \right)} = {\sum\limits_{j = {- J}}^{J}{p_{j}^{n}{\rho (\tau)}*{u\left( {p_{j},{t - {p_{j}x}}} \right)}\Delta \quad p_{j}}}$

When τ=t−px², the discrete parabolic inverse transformation is as follows: ${d\left( {x,t} \right)} = {\sum\limits_{j = {- J}}^{J}{p_{j}^{n}{\rho (\tau)}*{u\left( {p_{j},{t - {p_{j}x^{2}}}} \right)}\Delta \quad p_{j}}}$

Those skilled in the art will appreciate that the foregoing inverse transformation Equations 3 and 4 are not exact inverses of the forward transformation Equations 1 and 2. They are sufficiently accurate, however, and as compared to more exact inverse equations, they are less complicated and involve fewer mathematical computations. For example, more precise inverse transformations could be formulated with Fourier transform equations, but such equations require an extremely large number of computations to execute. For that reason, the foregoing equations are preferred, but it is believed that other inverse transformation equations are known, and still others may be devised by workers of ordinary skill for use in the subject invention.

The transformations and semblance analyses described above, as will be appreciated by those skilled in the art, are performed by sampling the data according to sampling variables Δt, Δx, Δτ, and Δp. Because the novel methods do not require NMO correction prior to transformation or a least mean square analysis, sampling variables may be much finer. Specifically, Δt and Δτ may be set as low as the sampling rate at which the data was collected, which is typically 1 to 4 milliseconds, or even lower if lower sampling rates are used. Δp values as small as about 0.5 μsec/m may be used. Preferably, Δp is from about 0.5 to 4.0 μsec/m, more preferably from about 0.5 to about 3.0 μsec/m, and even more preferably from about 0.5 to about 2.0 μsec/m. Most preferably Δp is set at 1.0 μsec/m. Since the sampling variables are finer, the calculations are more precise. It is preferred, therefore, that the sampling variables Δt, Δx, and Δτ be set at the corresponding sampling rates for the seismic data field records and that Δp be set at 1 μsec/m. In that manner, all of the data recorded by the receivers is processed. It also is not necessary to interpolate between measured offsets.

Moreover, the increase in accuracy achieved by using finer sampling variables in the novel processes is possible without a significant increase in computation time or resources. Although the novel transformation equations and offset weighting factors may be operating on a larger number of data points, those operations require fewer computations that prior art process. On the other hand, coarser sampling variables more typical of prior art processes may be used in the novel process, and they will yield accuracy comparable to that of the prior art, but with significantly less computational time and resources.

For example, industry commonly utilizes a process known as constant velocity stack (CVS) panels that in some respects is similar to processes of the subject invention. CVS panels and the subject invention both are implemented on common mid-point gathers prior to common mid-point stacking and before NMO correction. Thus, the starting point of both processes is the same.

In the processes of the subject invention, the discrete hyperbolic radon transform u(p,τ) is calculated by summing seismic trace amplitudes d(x,t) along a hyperbolic trajectory

t={square root over (τ² +p ² x ²)}

in offset-time (x,t) space for a particular tau-p (τ,p) parameter selection. Amplitudes d(x,t) are weighted according to a power n of the offset x, i.e., by the offset weighting factor x^(n). The summation and weighting process is described by the discrete forward transform Equation 2. In comparison, a CVS panel does not apply any offset dependent weighting.

In the processes of the subject invention, the calculation consists of first scanning over all desired zero-offset times τ for a given specification of p, and then changing the value of p and repeating the x-t summation for all desired taus (τ's). Thus, all desired values of τ and p are accounted for in the summations described by Equation 2 above.

A given choice of p describes a family of hyperbolas over the common midpoint gather's x-t space. A fixed value of p is equivalent to fixing the stacking velocity V, since p is defined as its reciprocal, viz., p=1/V_(s). By varying the zero-offset time τ over the desired τ-scan range for a fixed value of p=₁/V_(s), seismic amplitudes are summed in x-t space over a family of constant velocity hyperbolic trajectories. Thus, the novel Radon transforms u(p,τ) can be thought of as successively summing amplitudes over constant velocity hyperbolic time trajectories that have not been NMO corrected.

In constructing a CVS panel the starting point is a common midpoint gather. As in the case of the novel processes, successive scans over stacking velocity V_(s) and zero-offset time T_(o) are implemented for hyperbolic trajectories defined by the equation $t = \sqrt{T_{o}^{2} + \frac{x^{2}}{v_{s}^{2}}}$

The equivalence of T_(o)=τ and p=1/V_(s) in defining the same families of hyperbolas is obvious. The difference between the novel processes and CVS is in the implementation of amplitude summations. In both cases, a V_(s)=1/p is first held constant, and the T_(o)=τ is varied. A new V_(s)=1/p is then held constant, and the T_(o)=τ scan repeated. In this manner, the same families of hyperbolas are defined. However, an NMO correction is applied to all the hyperbolas defined by the V_(s)=1/p choice prior to summing amplitudes. A CVS trace is calculated for each constant velocity iteration by first NMO correcting the traces in the common midpoint gather and then stacking (i.e., summing) the NMO corrected traces. Thus, one CVS trace in a CVS panel is almost identical to a u(p=constant,τ) trace in the novel processes. The difference lies in whether amplitudes are summed along hyperbolic trajectories without an NMO correction as in the novel process or summed (stacked) after NMO correction.

The novel processes and CVS differ in the interpolations required to estimate seismic amplitudes lying between sample values. In the novel processes amplitude interpolations occur along hyperbolic trajectories that have not been NMO corrected. In the CVS procedure amplitude interpolation is an inherent part of the NMO correction step. The novel processes and CVS both sum over offset x and time t after interpolation to produce a time trace where p=1/V_(s) is held constant over time T_(o)=τ. Assuming interpolation procedures are equivalent or very close, then a single CVS time trace computed from a particular common midpoint gather with a constant V_(s)=1/p is equivalent in the novel processes to a time trace u(p,τ) where p=1/V_(s) is held constant. Thus, in actual practice the velocity ensemble of CVS traces for a single common midpoint gather corresponds to a coarsely sampled transformation of the same common midpoint gather according to the novel processes. As noted, however, the novel processes are capable of using finer sampling variables and thereby of providing greater accuracy.

Refining of the Stacking Velocity Function

The subject invention also encompasses improved methods for determining a stacking velocity function which may be used in processing seismic data. Such improved methods comprise the steps of performing a semblance analysis on the restored data to generate a second semblance plot. Though not essential, preferably an offset weighting factor x^(n), where 0<n<1, is first applied to the restored data. A velocity analysis is then performed on the second semblance plot to define a second stacking velocity function. It will be appreciated that this second stacking velocity, because it has been determined based on data processed in accordance with the subject invention, more accurately reflects the true stacking velocity function and, therefore, that inferred depths and compositions of geological formations and any other subsequent processing of the data that utilizes a stacking velocity function are more accurately determined.

For example, as shown in step 11 of FIG. 1, an offset weighting factor x^(n) is applied to the data that was restored in step 10. A semblance plot is then generated from the offset weighted data as shown in step 12. The semblance plot is used to determine a stacking velocity function in step 13 which then can be used in further processing as in step 14. Though not shown on FIG. 1, it will be appreciated that the semblance analysis can be performed on the inverse transformed data from step 9, thereby effectively applying an offset weighting factor since the effect of offset weighting the data prior to transformation has not been inversed.

Display and Further Processing of Data

After the data is restored, it may be displayed for analysis, for example, as shown in step 15 of FIG. 1. The restored data, as discussed above, may be used to more accurately define a stacking velocity function. It also may subject to further processing before analysis as shown in step 16. Such processes may include pre-stack time or depth migration, frequency-wave number filtering, other amplitude balancing methods, removal of aliasing effects, seismic attribute analysis, spiking deconvolution, data stack processing, and other methods known to workers in the art. The appropriateness of such further processing will depend on various geologic, geophysical, and other conditions well known to workers in the art.

Invariably, however, the data in the gather, after it has been processed and filtered in accordance with the subject invention, will be stacked together with other data gathers in the survey that have been similarly processed and filtered. The stacked data is then used to make inference about the subsurface geology in the survey area.

The methods of the subject invention preferably are implemented by computers and other conventional data processing equipment. Suitable software for doing so may be written in accordance with the disclosure herein. Such software also may be designed to process the data by additional methods outside the scope of, but complimentary to the novel methods. Accordingly, it will be appreciated that suitable software will include a multitude of discrete commands and operations that may combine or overlap with the steps as described herein. Thus, the precise structure or logic of the software may be varied considerably while still executing the novel processes.

EXAMPLES

The invention and its advantages may be further understood by reference to the following examples. It will be appreciated, however, that the invention is not limited thereto.

Example 1 Model Data

Seismic data was modeled in accordance with conventional considerations and plotted in the offset-time domain as shown in FIG. 4. Such data displays a common midpoint gather which includes desired primary reflections Re_(n) and undesired multiples reflections M_(n) beginning at 1.0, 1.5, 2.0, 2.5, 3.0 and 3.5 seconds. It also includes a desired water-bottom reflection WR at 0.5 seconds. It will be noted in particular that the signals for the desired reflections Re_(n) and WR overlap with those of the undesired multiple reflections M_(n).

The modeled seismic data was then transformed into the time-slowness domain utilizing a high resolution, hyperbolic Radon transformation of the subject invention and an offset weighting factor x⁰ ⁵. As shown in FIG. 5, the reflections Re_(n) WR, and M_(n) all map to concentrated point-like clusters in time-slowness space. Those points, however, map to different areas of time-slowness space, and thus, the points corresponding to undesired multiple reflections M_(n) can be eliminated by appropriate time-slowness filters, such as the time variant, high-low slowness filter represented graphically by lines 20. Thus, when the model data is inverse transformed back to the offset-time domain by a novel hyperbolic Radon inverse transformation, as shown in FIG. 6, only the desired primary reflections Re_(n) and the water-bottom reflection WR are retained.

Example 2 West Texas Production Area

A seismic survey was done in the West Texas area of the United States. FIG. 7 shows a portion of the data collected along a two-dimensional survey line. It is displayed in the offset-time domain and has been gathered into a common midpoint geometry. It will be noted that the data includes a significant amount of unwanted noise, including muted refractions appearing generally in an area 30, aliased ground roll occurring in area 31, and apparent air wave effects at areas 32.

In accordance with the subject invention, a conventional semblance analysis was performed on the data. The semblance plot was then used to identify a stacking velocity function and, based thereon, to define a filter that would preserve primary reflection events and eliminate noise.

The data of FIG. 7 was also transformed into the time-slowness domain with a high resolution, hyperbolic Radon transformation of the subject invention using an offset weighting factor x^(0.5). A time variant, high-low filter defined through the semblance analysis was applied to the transformed data, and the data was transformed back into the offset-time domain using a hyperbolic Radon inverse transform and an inverse of the offset weighting factor p^(0.5). The data then was displayed, which display is shown in FIG. 8.

In FIG. 8, seismic reflection signals appear as hyperbolas, such as those indicated at 33 and 34 (troughs). It will be noted that the unwanted noise that was present in the unprocessed data of FIG. 7 as muted refractions 30, aliased ground roll 31, and air wave effects 32 is no longer present in the processed display of FIG. 8.

The data of FIG. 8 was then stacked along with other processed and filtered CMP gathers from the survey in accordance with industry practice. A plot of the stacked data is shown in FIG. 9. Seismic reflection signals appear as horizontal lines, e.g., those lines appearing at approximately 0.45 sec and 1.12 sec, from which the depth of geological formations may be inferred.

By way of comparison, the data of FIG. 7, which had not been subject to filtering by the subject invention., and from other CMP gathers from the survey were conventionally processed and stacked in accordance with industry practice. The unfiltered, stacked data is shown in FIG. 10. It will be appreciated therefore that the stacked filter data of FIG. 9 show reflection events with much greater clarity due to the attenuation of noise by the novel methods. For example, the reflection signals appearing at 0.45 and 1.12 sec in FIG. 9 are not clearly present in FIG. 10.

Example 3 West African Production Area

A marine seismic survey was done in a West African offshore production area. FIG. 11 shows a portion of the data collected along a two-dimensional survey line. It is displayed in the offset-time domain and has been gathered into a common midpoint geometry. It will be noted that the data includes a significant amount of unwanted noise.

In accordance with the subject invention, a conventional semblance analysis was performed on the data. A plot of the semblance analysis is shown in FIG. 12. This semblance plot was then used to identify a stacking velocity function and, based thereon, to define a filter that would preserve primary reflection events and eliminate noise, in particular a strong water bottom multiple present at approximately 0.44 sec in FIG. 12. The semblance analysis was also used to define lower and upper slowness limits p_(min) and p_(max) for transformation of the data.

The data of FIG. 11 was also transformed, in accordance with the slowness limits p_(min) and p_(max), into the time-slowness domain with a high resolution, hyperbolic Radon transformation of the subject invention using an offset weighting factor x^(0.5). A time variant, high-low filter defined through the semblance analysis was applied to the transformed data, and the data was transformed back into the offset-time domain using a hyperbolic Radon inverse transform and an inverse of the offset weighting factor p^(0.5). The data then was displayed, which display is shown in FIG. 13.

In FIG. 13, seismic reflection signals appear as hyperbolas, such as those starting from the near offset (right side) at approximately 1.7 sec and 2.9 sec. It will be noted that the unwanted noise that was present in the unprocessed data of FIG. 11 was severely masking the reflection hyperbolas and is no longer present in the processed display of FIG. 13.

The processed data of FIG. 13 then was subject to a conventional semblance analysis. A plot of the semblance analysis is shown in FIG. 14. This semblance plot was then used to identify a stacking velocity function. By comparison to FIG. 12, it will be noted that the semblance plot of FIG. 14 shows the removal of various noise events, including the strong water bottom multiple present at approximately 0.44 sec in FIG. 12. Thus, it will be appreciated that the novel processes allow for a more precise definition of the stacking velocity function which then can be used in subsequent processing of the data, for example, as described below.

The data of FIG. 13, along with processed and filtered data from other CMP gathers in the survey, were then stacked in accordance with industry practice except that the stacking velocity function determined through the semblance plot of FIG. 14 was used. A plot of the stacked data is shown in FIG. 15. Seismic reflection signals appear as generally horizontal lines, from which the depth of geological formations may be inferred. For example, the reflective signals starting on the right side of the plot at approximately 0.41, 0.46, 1.29, and 1.34 sec. It will be noted, however, that the reflection signals in FIG. 15 slope and have slight upward curves from left to right. This indicates that the reflective formations are somewhat inclined, or what it referred to in the industry as “dip”.

By way of comparison, the unprocessed data of FIG. 11, along with data from other CMP gathers, were conventionally processed and then stacked in accordance with industry practice. The unfiltered, stacked data is shown in FIG. 16. It will be appreciated therefore that the stacked filter data of FIG. 15 show reflection events with much greater clarity due to the attenuation of noise by the novel methods. In particular, it will be noted that the reflection signals at 0.41 and 0.46 sec in FIG. 15 are not discernable in FIG. 16, and that the reflection signals at 1.29 and 1.34 sec are severely masked.

Example 4 Viosca Knoll Production Area

A marine seismic survey was done in the Viosca Knoll offshore region of the United States. FIG. 17 shows a portion of the data collected along a two-dimensional survey line. It is displayed in the offset-time domain and has been gathered into a common midpoint geometry. It will be noted that the data includes a significant amount of unwanted noise, including severe multiples created by short cable acquisition.

In accordance with the subject invention, a conventional semblance analysis was applied to the data. A plot of the semblance analysis is shown in FIG. 18. This semblance plot was then used to identify a stacking velocity function and, based thereon, to define a filter that would preserve primary reflection events and eliminate noise, in particular the multiples caused by short cable acquisition that are present generally from approximately 2.5 to 7.0 sec. The stacking velocity function is represented graphically in FIG. 18 as line 40. The semblance analysis was also used to define lower and upper slowness limits p_(min) and p_(max) for transformation of the data.

The data of FIG. 17 was also transformed, in accordance with the slowness limits p_(min) and p_(max), into the time-slowness domain with a high resolution, hyperbolic Radon transformation of the subject invention using an offset weighting factor x^(0.5). A time variant, high-low filter defined through the semblance analysis was applied to the transformed data, and the data was transformed back into the offset-time domain using a hyperbolic Radon inverse transform and an inverse of the offset weighting factor p^(0.5). The data then was displayed, which display is shown in FIG. 19.

In FIG. 19, seismic reflection signals appear as hyperbolas, such as those beginning at the near offset (right side) below approximately 0.6 sec. It will be noted that the unwanted noise that was present in the unprocessed data of FIG. 17 below 0.6 sec and severely masking the reflection hyperbolas is no longer present in the processed display of FIG. 19. In particular, it will be noted that the reflection signals beginning at the near offset at approximately 2.0 and 2.4 sec in FIG. 19 are not discemable in the unfiltered data of FIG. 17.

The processed data of FIG. 19 then was subject to a conventional semblance analysis. A plot of the semblance analysis is shown in FIG. 20. By comparison to FIG. 18 it will be noted that the semblance plot of FIG. 20 shows the removal of various noise events, including the strong multiples located generally from 2.5 to 7.0 sec in FIG. 18 that were created by short cable acquisition. The semblance plot was then used to identify a stacking velocity function, which is represented graphically in FIG. 20 as line 41. Thus, it will be appreciated that the novel processes allow for a more precise definition of the stacking velocity function which then can be used in subsequent processing of the data, for example, as described below.

The data of FIG. 19, along with the data from other CMP gathers that had been processed and filtered with the novel methods, were then stacked in accordance with industry practice except that the stacking velocity function determined through the semblance plot of FIG. 20 was used. A plot of the stacked data is shown in FIG. 21. Seismic reflection signals appear as horizontal lines, from which the depth of geological formations may be inferred. In particular, the presence of various traps potentially holding reserves of oil or gas appear generally in areas 42, 43, 44, 45, and 46, as seen in FIG. 21A, which is an enlargement of area 21A of FIG. 21.

By way of comparison, the data of FIG. 19 and data from other CMP gathers in the survey was processed in accordance with conventional methods based on parabolic Radon transformations. In contrast to the subject invention, the data were first NMO corrected. The NMO corrected data then were transformed, without any transformation limits, to the tau-P domain using a low resolution parabolic Radon transformation that did not apply an offset weighting factor x^(n). A conventional mute filter then was applied, and the preserved data were transformed back into the offset-time domain using a conventional parabolic Radon inverse transform that did not apply an inverse offset weighting factor p^(n). The NMO correction was reversed to restore the preserved data and it was subtracted from the original data in the respective gathers.

The data that had been processed and filtered with the parabolic Radon forward and inverse transforms was then stacked in accordance with industry practice. A plot of the stacked data is shown in FIG. 22. Seismic reflection signals appear as horizontal lines, from which the depth of geological formations may be inferred. It will be noted, however, that as compared to the stacked plot of FIG. 21, reflection events are shown with much less clarity. As may best be seen in FIG. 22A, which is an enlargement of area 22A in FIG. 22, and which corresponds to the same portion of the survey profile as shown in FIG. 21A, traps 42, 43, 44 45, and 46 are not revealed as clearly by the conventional process.

The foregoing examples demonstrate the improved attenuation of noise by the novel methods and thus, that the novel methods ultimately allow for more accurate inferences about the depth and composition of geological formations.

While this invention has been disclosed and discussed primarily in terms of specific embodiments thereof, it is not intended to be limited thereto. Other modifications and embodiments will be apparent to the worker in the art. 

What is claimed is:
 1. A method of processing seismic data to remove unwanted noise from meaningful reflection signals indicative of subsurface formations, comprising the steps of: (a) obtaining field records of seismic data detected at a number of seismic receivers in an area of interest, said seismic data comprising signal amplitude data recorded over time and containing both primary reflection signals and unwanted noise events; (b) assembling said seismic data into common geometry gathers in an offset-time domain; (c) transforming said amplitude data from the offset-time domain to the time-slowness domain using a Radon transformation; (d) applying a high-low corrective filter to enhance the primary reflection signal content of said transformed data and to eliminate unwanted noise events; and (e) inverse transforming said filtered data from the time-slowness domain back to the offset-time domain using an inverse Radon transformation, thereby restoring the signal amplitude data for said filtered data.
 2. The method of claim 1, wherein said high-low corrective filter is determined by: (a) performing a semblance analysis on said amplitude data to generate a semblance plot; and (b) performing a velocity analysis on said semblance plot to define a stacking velocity function and said high-low corrective filter.
 3. The method of claim 1, wherein said high-low corrective filter is determined by performing a pre-stack time migration analysis on said amplitude data to define a velocity function and said high-low corrective filter.
 4. The method of claim 1, wherein said high-low corrective filter is time variant.
 5. The method of claim 1, wherein said corrective filter is defined as follows: $\frac{1}{v_{s}\left( {1 + r_{2}} \right)} \leq p \leq \frac{1}{v_{s}\left( {1 - r_{1}} \right)}$

where r₁ and r₂ are percentages expressed as decimals.
 6. The method of claim 1, wherein: (a) an offset weighting factor x^(n) is applied to said assembled amplitude data, wherein 0<n<1; and (b) an inverse of the offset weighting factor p^(n) is applied to said inverse transformed data, wherein 0<n<1.
 7. The method of claim 6, wherein n in the offset weighting factor x^(n) and the inverse of the offset weighting factor p^(n) is approximately 0.5.
 8. The method of claim 1, wherein: (a) an amplitude balancing operator is applied to said assembled amplitude data; and (b) an inverse of the amplitude balancing operator is applied to said inverse transformed data.
 9. The method of claim 8, wherein said amplitude balancing operator is an automatic gain control operator.
 10. The method of claim 8, wherein said amplitude balancing operator is a gain control operator equal to the inverse of the trace envelope for each trace, and the inverse of said amplitude balancing operator is an inverse gain control operator equal to the trace envelope for each trace.
 11. The method of claim 1, wherein said Radon transformation is applied within defined slowness limits p_(min) and p_(max), where p_(min) is a predetermined minimum slowness and p_(max) is a predetermined maximum slowness.
 12. The method of claim 11, wherein p_(max) is greater than the slowness of reflection signals from the shallowest reflective surface of interest, and p_(min) is less than the slowness of reflection signals from the deepest reflective surface of interest.
 13. The method of claim 1, wherein said Radon transformation is applied according to an index j of the slowness set and a sampling variable Δp; wherein ${j = \frac{p_{\max} - p_{\min} + {1\quad {µsec}\text{/}m}}{\Delta \quad p}},$

Δp is from about 0.5 to about 4.0 μsec/m, p_(max) is a predetermined maximum slowness, and p_(min) is a predetermined minimum slowness.
 14. The method of claim 13, wherein p_(max) is greater than the slowness of reflection signals from the shallowest reflective surface of interest, and p_(min) is less than the slowness of reflection signals from the deepest reflective surface of interest.
 15. The method of claim 1, wherein said seismic data is assembled into common midpoint geometry gathers.
 16. The method of claim 1, wherein the forward and inverse transform functions in said Radon transformations are selected from the transform functions for linear slant stack, parabolic, and hyperbolic kinematic travel time trajectories.
 17. The method of claim 1, wherein said amplitude data is transformed using a hyperbolic Radon transformation and inverse transformed using an inverse hyperbolic Radon transformation.
 18. The method of claim 1, wherein said amplitude data is transformed using a non-hyperbolic Radon transformation and inverse transformed using an inverse non-hyperbolic Radon transformation.
 19. The method of claim 18, wherein the forward and inverse transform functions in said non-hyperbolic Radon transformations are selected to account for anisotropy, P-S converted waves, or wave-field separations.
 20. The method of claim 6, wherein said offset weighting factor x^(n) is applied and said amplitude data is transformed with a continuous Radon transformation defined as follows: u(p, τ) = ∫_(−∞)^(∞)  x∫_(−∞)^(∞)  t  (x, t)x^(n)δ[f(t, x, τ, p)]

or a discrete Radon transformation approximating said continuous Radon transformation, and said enhanced signal content is inversed transformed and said inverse offset weighting factor p^(n) is applied with a continuous inverse Radon transformation defined as follows: d(x, t) = ∫_(−∞)^(∞)  p∫_(−∞)^(∞)  τ  p^(n)ρ(τ) * u(p, τ)δ[g(t, x, τ, p)]

or a discrete Radon transformation approximating said continuous inverse Radon transformation, where u(p,τ)=transform coefficient at slowness p and zero-offset time τd(x,t)=measured seismogram at offset x and two-way time t x^(n)=offset weighting factor (0<n<1 p^(n)=inverse offset weighting factor (0<n<1 ρ(τ)*=convolution of rho filter δ=Dirac delta function ƒ(t,x,τ,p)=forward transform function g(t,x,τ,p)=inverse transform function.
 21. The method of claim 20, wherein said forward transform function, ƒ(t,x,τ,p), and said inverse transform function g(t,x,τ,p), are selected from the transform functions for linear slant stack, parabolic, and hyperbolic kinematic travel time trajectories, which functions are defined as follows: (a) transform functions for linear slant stack: ƒ(t,x,τ,p)=t−τ−px g(t,x,τ,p)=τ−t+px (b) transform functions for parabolic: ƒ(t,x,τ,p)=t−τ−px ² g(t,x,τ,p)=τ−t+px² (c) transform functions for hyperbolic: τ(t,x,τ,p)=t−{square root over (τ²+p²x²)} g(t,x,τ,p)=τ−{square root over (t ² −p ² x2)}.
 22. The method of claim 6, wherein said offset weighting factor x^(n) is applied and said amplitude data is transformed with a continuous hyperbolic Radon transformation defined as follows: ${u\left( {p,\tau} \right)} = {\int_{- \infty}^{\infty}{{{xx}^{n}}{\left( {x,\sqrt{\tau^{2} + {p^{2}x^{2}}}} \right)}}}$

or a discrete hyperbolic Radon transformation approximating said continuous hyperbolic Radon transformation, and said enhanced signal content is inversed transformed and said inverse offset weighting factor p^(n) applied with a continuous inverse hyperbolic Radon transformation defined as follows: ${d\left( {x,t} \right)} = {\int_{- \infty}^{\infty}{{{pp}^{n}}{\rho (\tau)}*{u\left( {p,\sqrt{t^{2} - {p^{2}x^{2}}}} \right)}}}$

or a discrete inverse hyperbolic Radon transformation approximating said continuous inverse hyperbolic Radon transformation, where u(p,τ)=transform coefficient at slowness p and zero-offset time τ d(x,t)=measured seismogram at offset x and two-way time t x^(n)=offset weighting factor ( 0<n<1) p^(n)=inverse offset weighting factor (0<n<1) ρ(τ)*=convolution of rho filter δ=Dirac delta function ƒ(t,x,τ,p)=t−{square root over (τ²+p²x²)} g(t,x,τ,p)=t−{square root over (τ²−p²x²)}.
 23. The method of claim 6, wherein said offset weighting factor x^(n) is applied and said amplitude data is transformed with a discrete Radon transformation defined as follows: ${u\left( {p,\tau} \right)} = {\sum\limits_{l = {- L}}^{L}{\sum\limits_{k = 1}^{N}{{d\left( {x_{l},t_{k}} \right)}x_{l}^{n}{\delta \left\lbrack {f\left( {t_{k},x_{l},\tau,p} \right)} \right\rbrack}\Delta \quad x_{l}\Delta \quad t_{k}}}}$

where u(p,τ)=transform coefficient at slowness p and zero-offset time τd(x_(l),t_(k))=measured seismogram at offset xi and two-way time t_(k) x_(l) ^(n)=offset weighting factor at offset x_(l) (0<n <1) δ=Dirac delta function ƒ(t_(k),x_(l),τ,p)=forward transform function at t_(k) and x_(l) ${{\Delta \quad x_{l}} = {{\frac{x_{l + 1} - x_{l - 1}}{2}\quad {for}\quad l} = 0}},{\pm 1},\ldots \quad,{\pm \left( {L - 1} \right)}$

Δx_(L)=x_(L)−x_(L−1) Δx_(−L)=x_(−L+1)−x_(−L) ${{\Delta \quad t_{k}} = {{\frac{t_{k + 1} - t_{k - 1}}{2}\quad {for}\quad k} = 2}},\ldots \quad,{N - 1}$

Δt₁=t₂−t₁ Δt_(N)=t_(N)−t_(N−1) and said enhanced signal content is inversed transformed and said inverse offset weighting factor p^(n) is applied with a discrete inverse Radon transformation defined as follows: ${d\left( {x,t} \right)} = {\sum\limits_{J = {- J}}^{J}{\sum\limits_{m = 1}^{M}{{u\left( {p_{j},\tau_{m}} \right)}p_{j}^{n}{\rho (\tau)}*{\delta \left\lbrack {g\left( {t,x,\tau_{m},p_{j}} \right)} \right\rbrack}\Delta \quad p_{j}\Delta \quad \tau_{m}}}}$

where u(p_(j),τ_(m))=transform coefficient at slowness p_(j) and zero-offset time τ_(m) d(x,t)=measured seismogram at offset x and two-way time t p_(j) ^(n)=inverse offset weighting factor at slowness p_(j) (0<n <1) ρ(τ)*=convolution of rho filter δ=Dirac delta function g(t,x,τ_(m),p_(j))=inverse transform function at τ_(m) and p_(j) ${{\Delta \quad p_{j}} = {{\frac{p_{j + 1} - p_{j - 1}}{2}\quad {for}\quad j} = 0}},{\pm 1},\ldots \quad,{\pm \left( {J - 1} \right)}$

Δp_(j)=p_(j)−p_(j−1) Δp_(−j)=p_(−j+1)−p_(j−1) ${{\Delta \quad \tau_{m}} = {{\frac{\tau_{m + 1} - \tau_{m - 1}}{2}\quad {for}\quad m} = 2}},\ldots \quad,{M - 1}$

Δt₁=t₂−t₁ Δt_(m)=t_(m)−t_(m−1).
 24. The method of claim 23, wherein said forward transform function, f(t_(k),x_(l),τ,p), and said inverse transform function, g(t,x,τ_(m),p_(j)), are selected from the transform functions for linear slant stack, parabolic, and hyperbolic kinematic travel time trajectories, which functions are defined as follows: (a) transform functions for linear slant stack: ƒ(t _(k) ,x ₁ ,τ,p)=t _(k) −τ−px ₁ g(t,x,τ _(m) ,p _(j))=τ_(m) −t+p _(j) x (b) transform functions for parabolic: ƒ(t _(k) ,x ₁ ,τ,p)=t _(k) −τ−px ₁ ² g(t,x,τ _(m) ,p _(j))=τ_(m) +t−p _(j) x ² (c) transform functions for hyperbolic: ƒ(t _(k) ,x ₁ ,τ,p)=t _(k) −{square root over (τ²+p²x₁ ²)} g(t,x,τ _(m) ,p _(j))=τ_(m) −{square root over (t²−p²x₁ ²)}.
 25. The method of claim 6, wherein said offset weighting factor x^(n) is applied and said amplitude data is transformed with a discrete hyperbolic Radon transformation defined as follows: ${u\left( {p,\tau} \right)} = {\sum\limits_{l = {- L}}^{L}{x_{l}^{n}{d\left( {x_{l},\sqrt{\tau^{2} + {p^{2}x_{l}^{2}}}} \right)}\Delta \quad x_{l}}}$

where u(p,τ)=transform coefficient at slowness p and zero-offset time τ x_(l) ^(n)=offset weighting factor at offset x_(l) (0<n<1) ${{\Delta \quad x_{l}} = {{\frac{x_{l + 1} - x_{l - 1}}{2}\quad {for}\quad l} = 0}},{\pm 1},\ldots \quad,{\pm \left( {L - 1} \right)}$

Δx_(L)=x_(L)−x_(L−1) Δx_(−L)=x_(−L+1)−x_(−L) and said enhanced signal content is inversed transformed and said inverse offset weighting factor p^(n) applied with a discrete inverse hyperbolic Radon transformation defined as follows: ${d\left( {x,t} \right)} = {\sum\limits_{j = {- J}}^{J}{p_{j}^{n}{\rho (\tau)}*{u\left( {p_{j},\sqrt{t^{2} - {p_{j}^{2}x^{2}}}} \right)}\Delta \quad p_{j}}}$

where d(x,t)=measured seismogram at offset x and two-way time t p_(j) ^(n)=inverse offset weighting factor at slowness p_(j) (0<n<1) ρ(τ)*=convolution of rho filter ${{\Delta \quad p_{j}} = {{\frac{p_{j + 1} - p_{j - 1}}{2}\quad {for}\quad j} = 0}},{\pm 1},\ldots \quad,{\pm \left( {J - 1} \right)}$

Δp_(J)=p_(J)−p_(J−1) Δp_(−J)=p_(−J+1)−p_(−J).
 26. The method of claim 1, wherein a corrective filter is applied to said amplitude data prior to transforming said data into the time-slowness domain.
 27. The method of claim 2, wherein an offset weighting factor x^(n), where 0<n<1, is applied to said amplitude data prior to performing said semblance analysis.
 28. The method of claim 2, wherein said semblance analysis is performed in the tau-P domain.
 29. The method of claim 1, further comprising the step of forming a display of said restored data.
 30. A method for determining a stacking velocity function, which method comprises the method of claim 1 and further comprises the steps of: (a) performing a semblance analysis on said restored data to generate a semblance plot; and (b) performing a velocity analysis on said semblance plot to define a stacking velocity function.
 31. A method for determining a stacking velocity function, which method comprises the method of claim 1 and further comprises the steps of: (a) applying an offset weighting factor x^(n) to said restored amplitude data, wherein 0<n<1; (b) performing a semblance analysis on said offset weighted, restored data to generate a semblance plot; and (c) performing a velocity analysis on said semblance plot to define a stacking velocity function. 